منابع مشابه
Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملRethinking perceptual organization: The role of uniform connectedness.
A principle of perceptual organization, calleduniform connectedness (UC), is described, and a theoretical approach to perceptual organization is proposed in which this principle plays a fundamental role. The principle of UC states that closed regions of homogeneous properties-such as lightness, chromatic color, texture, and so forth-tend to be perceived initially as single units. We demonstrate...
متن کاملUniform connectedness and classical Gestalt principles of perceptual grouping.
We assessed whether uniform connectedness (UC; Palmer & Rock, 1994) operates prior to effects reflecting classical principles of grouping: proximity and similarity. In Experiments 1 and 2, reaction times to discriminate global letters (H vs. E), made up of small circles, were recorded. The small circles were respectively grouped by proximity, similarity of shapes, and by UC. The discrimination ...
متن کاملOn Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملOn the probability of connectedness
Given a class of structures with a notion of connectedness (satisfying some reasonable assumptions), we consider the limit (as n -+ oc) of the probability that a random (labelled or unlabelled) n-element structure in the class is connected. The paper consists of three parts: two specific examples, N-free graphs and posets, where the limiting probability of connectedness is one-half and the gold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1989
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171289000530